A short note about exposed points in real banach spaces

We express the set of exposed points in terms of rotund points and non-smooth points.As long as we have Banach spaces each time＂bigger＂,we consider sets of non-smooth points each time＂smaller＂.     

Asymptotics of variance of the lattice point count

The variance of the number of lattice points inside the dilated bounded set rD with random position in ℝ ^d has asymptotics ∼ r ^d−1 if the rotational average of the squared modulus of the Fourier transform of the set is O(ϰ ^−d−1). The asymptotics follow from Wiener’s Tauberian theorem.     

Full analogy of Sharkovsky's theorem for lower semicontinuous maps

A full analogy of the celebrated Sharkovsky cycle coexistence theorem is established for lower semicontinuous (multivalued) maps on metrizable linear continua. This result is further extended to triangular maps.     

Convergence of MPFA on triangulations and for Richards' equation

Spatial discretization of transport and transformation processes in porous media requires techniques that handle general geometry, discontinuous coefficients and are locally mass conservative. Multi‐point flux approximation (MPFA) methods are such techniques, and we will here discuss some formulations on triangular grids with further application to the nonlinear Richards equation. The MPFA methods will be rewritten to mixed form to derive stability conditions and error estimates. Several MPFA versions will be shown, and the versions will be discussed with respect to convergence, symmetry and robustness when the grids are rough. It will be shown that the behavior may be quite different for challenging cases of skewness and roughness of the simulation grids. Further, we apply the MPFA discretization approach for the Richards equation and derive new error estimates without extra regularity requirements. The analysis will be accompanied by numerical results for grids that are relevant for practical simulation. Copyright © 2008 John Wiley & Sons, Ltd.     

Strong law of large numbers for Markov chains indexed by an infinite tree with uniformly bounded degree

In this paper,we study the strong law of large numbers and Shannon-McMillan (S-M) theorem for Markov chains indexed by an infinite tree with uniformly bounded degree.The results generalize the analogous results on a homogeneous tree.     

A birth–death model for Web cache systems: Numerical solutions and simulation

In this paper, we study Web cache hit rates by introducing a birth–death model. A system consisting of a single Web server with a single cache stores Web pages that are classified as hot pages (popular pages) and cold pages (less popular pages). Given requested probabilities for each class, the stochastic model provides the mean hit rate for a random replacement algorithm and the upper and low bounds for other algorithms. Numerical results from the analysis are validated using the output of simulation programs that utilize the LRU algorithm.     

Spacelike Willmore surfaces in 4-dimensional Lorentzian space forms

Spacelike Willmore surfaces in 4-dimensional Lorentzian space forms, a topic in Lorentzian conformal geometry which parallels the theory of Willmore surfaces in S4, are studied in this paper. We define two kinds of transforms for such a surface, which produce the so-called left/right polar surfaces and the adjoint surfaces. These new surfaces are again conformal Willmore surfaces. For them the interesting duality theorem holds. As an application spacelike Willmore 2-spheres are classified. Finally we construct a family of homogeneous spacelike Willmore tori.     

A method of summation of divergent series to any accuracy

We propose a new method of summation to any accuracy for a wide class of divergent series, using only a finite number of terms of the series. Translated fromMatematicheskie Zametki, Vol. 68, No. 1, pp. 24–35, July, 2000.     

Large deviations for sums of i.i.d. random compact sets

We prove a large deviation principle for Minkowski sums of i.i.d. random compact sets in a Banach space, that is, the analog of Cramér theorem for random compact sets.

     

Pattern memory analysis based on stability theory of cellular neural networks

In this paper, several sufficient conditions are obtained to guarantee that the n-dimensional cellular neural network can have even (?2ⁿ) memory patterns. In addition, the estimations of attractive domain of such stable memory patterns are obtained. These conditions, which can be directly derived from the parameters of the neural networks, are easily verified. A new design procedure for cellular neural networks is developed based on stability theory (rather than the well-known perceptron training algorithm), and the convergence in the new design procedure is guaranteed by the obtained local stability theorems. Finally, the validity and performance of the obtained results are illustrated by two examples.